Combinatorial Construction of Time - StampSystems and Interpolation Systems
نویسنده
چکیده
A time-stamp system allows to maintain in a distributed way a total order among a set of objects by assigning them some labels or time-stamps. An elementary operation consists in moving one of these objects from the ith position to the rst one by only modifying its time-stamp. We introduce the notion of interpolation system, which generalizes the previous notion by allowing the objects to move from any position to any other position. Time-stamp systems and interpolation systems can be described as directed graphs (whose vertices stand for time-stamps) satisfying some special properties. We study in this paper diierent construction mechanisms leading to such systems. R esum e. Un syst eme d'estampillage permet de g erer de faa con distribu ee un ordre total sur des objets en leur attribuant des etiquettes ou estampilles. Une action el ementaire consiste a faire passer un objet d'une position i quelconque en position 1 en modiiant uniquement l'estampille de cet objet. Nous introduisons ici la notion de syst eme d'interpolation qui g en eralise la notion pr ec edente en permettant de faire passer un objet d'une position i quelconque en une position j quelconque. Les syst emes d'estampillage et d'interpolation peuvent ^ etre repr esent es sous forme de graphes orient es (dont les sommets constituent les estampilles) satisfaisant certaines propri et es. Nous etudions ici dii erents m ecanismes de construction permettant d'obtenir de tels syst emes.
منابع مشابه
Development of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملNo feasible monotone interpolation for simple combinatorial reasoning
The feasible monotone interpolation method has been one of the main tools to prove the exponential lower bounds for relatively weak propositional systems. In [1], we introduced a simple combinatorial reasoning system, GCNF+permutation, as a candidate for an automatizable, though powerful, propositional calculus. We show that the monotone interpolation method is not applicable to prove the super...
متن کاملOptimization of profit and customer satisfaction in combinatorial production and purchase model by genetic algorithm
Optimization of inventory costs is the most important goal in industries. But in many models, the constraints are considered simple and relaxed. Some actual constraints are to consider the combinatorial production and purchase models in multi-products environment. The purpose of this article is to improve the efficiency of inventory management and find the economic order quantity and economic p...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملNew adaptive interpolation schemes for efficient meshbased motion estimation
Motion estimation and compensation is an essential part of existing video coding systems. The mesh-based motion estimation (MME) produces smoother motion field, better subjective quality (free from blocking artifacts), and higher peak signal-to-noise ratio (PSNR) in many cases, especially at low bitrate video communications, compared to the conventional block matching algorithm (BMA). Howev...
متن کامل